Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
نویسندگان
چکیده
We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices (B1, . . . , Bm) and (C1, . . . , Cm), whether there exists an invertible matrix A such that for every i ∈ {1, . . . ,m}, ABiA = Ci. We show that this problem can be solved in randomized polynomial time over finite fields of odd size, the reals, and the complex numbers. The second problem asks to decide, given a tuple of square matrices (B1, . . . , Bm), whether there exist invertible matrices A and D, such that for every i ∈ {1, . . . ,m}, ABiD is (skew-)symmetric. We show that this problem can be solved in deterministic polynomial time over fields of characteristic not 2. For both problems we exploit the structure of the underlying ∗-algebras (algebras with an involutive anti-automorphism), and utilize results and methods from the module isomorphism problem. Applications of our results range from multivariate cryptography, group isomorphism, to polynomial identity testing. Specifically, these results imply efficient algorithms for the following problems. (1) Test isomorphism of quadratic forms with one secret over a finite field of odd size. This problem belongs to a family of problems that serves as the security basis of certain authentication schemes proposed by Patarin (Eurocrypt 1996). (2) Test isomorphism of pgroups of class 2 and exponent p (p odd) with order p in time polynomial in the group order, when the commutator subgroup is of order p √ . (3) Deterministically reveal two families of singularity witnesses caused by the skew-symmetric structure. This represents a natural next step for the polynomial identity testing problem, in the direction set up by the recent resolution of the non-commutative rank problem (Garg-Gurvits-Oliveira-Wigderson, FOCS 2016; IvanyosQiao-Subrahmanyam, ITCS 2017).
منابع مشابه
Automorphisms of Rings and Applications to Complexity
Rings are fundamental mathematical objects with two operations, addition and multiplication, suitably defined. A known way of studying the structure of rings is to consider automorphisms of rings. In my PhD thesis I consider finite dimensional rings represented in terms of their additive basis and study the computational complexity of various automorphism problems of rings in this representatio...
متن کاملIsomorphism testing of read-once functions and polynomials
In this paper, we study the isomorphism testing problem of formulas in the Boolean and arithmetic settings. We show that isomorphism testing of Boolean formulas in which a variable is read at most once (known as read-once formulas) is complete for log-space. In contrast, we observe that the problem becomes polynomial time equivalent to the graph isomorphism problem, when the input formulas can ...
متن کاملImproved Algorithms for Isomorphisms of Polynomials { Extended Version {
This paper is about the design of improved algorithms to solve Isomorphisms of Polynomials (IP) problems. These problems were rst explicitly related to the problem of nding the secret key of some asymmetric cryptographic algorithms (such as Matsumoto and Imai's C scheme of 13], or some variations of Patarin's HFE scheme of 15]). Moreover, in 15], it was shown that IP can be used in order to des...
متن کاملImproved Algorithms for Isomorphisms of Polynomials { Extended
This paper is about the design of improved algorithms to solve Isomorphisms of Polynomials (IP) problems. These problems were rst explicitly related to the problem of nding the secret key of some asymmetric cryptographic algorithms (such as Matsumoto and Imai's C scheme of 13], or some variations of Patarin's HFE scheme of 15]). Moreover, in 15], it was shown that IP can be used in order to des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018